منابع مشابه
Local Large Deviations, McMillian Theorem for multitype Galton-Watson Processes
Abstract. In this article we prove a local large deviation principle (LLDP) for the critical multitype Galton-Watson process from spectral potential point. We define the so-called a spectral potential UK( ·, π) for the Galton-Watson process, where π is the normalized eigen vector corresponding to the leading Perron-Frobenius eigen value 1l of the transition matrix A(·, ·) defined from K, the tr...
متن کاملInvariance principles for spatial multitype Galton-Watson trees
We prove that critical multitype Galton-Watson trees converge after rescaling to the Brownian continuum random tree, under the hypothesis that the offspring distribution has finite covariance matrices. Our study relies on an ancestral decomposition for marked multitype trees. We then couple the genealogical structure with a spatial motion, whose step distribution may depend on the structure of ...
متن کاملMartin-Löf randomness and Galton-Watson processes
The members of Martin-Löf random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-Löf random Galton–Watson trees with survival parameter 2 3 . To be such a member, a sufficient condition is to have effective Hausdorff dimension strictly greater than γ = log2 3 2 , and a necessary condition is to have effective Hausdorff dimension greate...
متن کاملParallel Galton Watson Process
In this paper, we study a parallel version of GaltonWatson processes for the random generation of tree-shaped structures. Random trees are useful in many situations (testing, binary search, simulation of physics phenomena,...) as attests more than 49000 citations on Google scholar. Using standard analytic combinatorics, we first give a theoretical, averagecase study of the random process in ord...
متن کاملSubcritical Galton-Watson Trees
Each variable X is a new, independent Uniform [0, 1] random number. For example, T = ∅ with probability 1−p, T = (∅, ∅) with probability p(1−p)2, and T = ((∅, ∅), ∅) with probability p2(1− p). The number of vertices N is equal to twice the number of left parentheses (parents) in the expression for T , plus one. Equivalently, N is twice the number of ∅s (leaves), minus one. It can be shown that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1972
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700045056